Computing transitive closure of bipolar weighted digraphs

Efficient Parallel Implementation of Transitive Closure of Digraphs

Pebble Weighted Automata and Transitive Closure Logics

We introduce new classes of weighted automata on words. Equipped with pebbles and a two-way mechanism, they go beyond the class of recognizable formal power series, but capture a weighted version of first-order logic with bounded transitive closure. In contrast to previous work, this logic allows for unrestricted use of universal quantification. Our main result states that pebble weighted autom...

An Efficient Transitive Closure Algorithm for Cyclic Digraphs

We present a new transitive closure algorithm that is based on strong component detection. The new algorithm is more eecient than the previous transitive closure algorithms that are based on strong components detection, since it does not generate unnecessary partial successor sets and scans the input graph only once.

Linear Systolic Arrays for Computing Transitive Closure

This paper addresses the problem of computing transitive closure of a given directed graph on linear systolic arrays (SA). We have designed three linear SAs, including two static SAs and a bi-directional SA. Then we compare obtained arrays in term of execution time, number of processing elements and efficiency.

3-transitive Digraphs

Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A digraph D is 3-transitive if the existence of the directed path (u, v, w, x) of length 3 in D implies the existence of the arc (u, x) ∈ A(D). In this article strong 3-transitive digraphs are characterized and the structure of non-strong 3-transitive digraphs is described. The results are used, e.g...